On Mixed Connectivity Certificates
نویسندگان
چکیده
Vertex and edge connectivity are special cases of mixed connectivity, in which all edges and a specified set of vertices play a similar role. Certificates of k-connectivity for a graph are obtained by removing a subset of its edges, while preserving its connectivity up to k. We unify the previous work on connectivity certificates and extend it to handle mixed connectivity and multigraphs. Our treatment contributes a new insight of the pertinent structures, yielding more general results and simpler proofs. Also, we present the first co~unicationoptimal dis~buted algo~thm for finding mixed connectivi~ certificates. @ 1998 Published by Etsevier Science B.V. All rights reserved Krywor&: Connectivity certificates; Mixed connectivity; Distributed algorithm
منابع مشابه
Sparse graph certificates for mixed connectivity
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T -mixed connectivity up to k. © 2005 Elsevier B.V. All rights reserved.
متن کاملSparse certificates and removable cycles in l-mixed p-connected graphs
A graph G = (V,E) is called l-mixed p-connected if G−S−L is connected for all pairs S, L with S ⊆ V , L ⊆ E, and l|S|+ |L| < p. This notion is a common generalisation of m-vertex-connectivity (l = 1, p = m) and m-edge-connectivity (l ≥ m, p = m). If p = kl then we obtain (k, l)-connectivity, introduced earlier by Kaneko and Ota, as a special case. We show that by using maximum adjacency orderin...
متن کاملSparse Certificates and Scan-First Search
An algorithm for the parallel construction of k-connectivity certificates for graphs, Scan-First Search, was introduced by Joseph Cheriyan, Ming-Yang Kao, and Ramakrishna Thurimella in their paper Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for KVertex Connectivity.[2] The following is an attempt to clarify and simplify the concepts and proofs presented in that paper.
متن کاملConnectivity as a Measure of Power System Integrity
Measures of network structural integrity useful in the analysis and synthesis of power systems are discussed. Signal flow methodology is applied to derive an expression for the paths between sources and sinks in a power network. Connectivity and reach ability properties of the network are obtained using the minors of a modified connectivity matrix. Node-connectivity, branch connectivity and mix...
متن کاملPositivstellensatz Certificates for Non-feasibility of Connectivity Graphs in Multi-agent Coordination
In this paper, we discuss how to obtain certificates for the non-feasibility of connectivity graphs arising from multi-agent formations. We summarize some previous work on connectivity graphs and their feasibility. Next, we introduce the Positivstellensatz to show how it can be used to better understand the space of all connectivity graphs for a fixed number of vertices, which had previously be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 203 شماره
صفحات -
تاریخ انتشار 1998